package cn.edu.thu.thss.algorithm.graphs.adjmatrix;

public class MinimalSpanningTreeUtils {
	public void Kruskal(Edge[] edges) {
		
	}
}

class Edge implements Comparable<Edge>{
	int startVertex;
	int endVertex;
	double weight;
	public int compareTo(Edge o) {
		int result = 0;
		if (weight < o.weight) {
			result = -1;
		} else if (weight > o.weight) {
			result = 1;
		}
		return result;
	}
}
